Reflecting point-countable families

The Point - Countable Base Problem

Chapter 14 The Point - Countable Base Problem

AIF-ω: Set-Based Protocol Abstraction with Countable Families

Abstraction based approaches like ProVerif are very efficient in protocol verification, but have a limitation in dealing with stateful protocols. A number of extensions have been proposed to allow for a limited amount of state information while not destroying the advantages of the abstraction method. However, the extensions proposed so far can only deal with a finite amount of state information...

On proximities generated by countable families of entourages

It is shown that any proximity that is generated by a countable family of entourages is sequential. Metrization theorems for proximities are derived.

A Hall Criterion for Countable Families of Sets

Let F = (f(i)|i 6 /) be a countable family. By recursion we define subsets /a(B) of/ and prove that there is an ordinal X such that F has an injective choice function if and only if |B| ^ \\J{IJ.B)\y < X) | for every finite set B.